Computer chess programs typically use some form of heuristics to assess how good a board position is, or other aspects of the game play. These chess heuristics can then be used with game tree search techniques such as minimax or Monte Carlo tree search. In older chess programs the heuristic might be hand coded, but now the heurustic may be a value network or policy network; forms of deep neural network that have been trained on real or simulated games.
Used in Chap. 11: page 152
Used in glossary entries: chess program, deep neural network, game tree, minimax search, Monte Carlo tree search, policy network, value network